翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Weiszfeld's algorithm : ウィキペディア英語版
Geometric median

The geometric median of a discrete set of sample points in a Euclidean space is the point minimizing the sum of distances to the sample points. This generalizes the median, which has the property of minimizing the sum of distances for one-dimensional data, and provides a central tendency in higher dimensions. It is also known as the 1-median,〔The more general ''k''-median problem asks for the location of ''k'' cluster centers minimizing the sum of distances from each sample point to its nearest center.〕 spatial median,〔 Euclidean minisum point, or Torricelli point.
The geometric median is an important estimator of location in statistics, where it is also known as the ''L''1 estimator.〔 It is also a standard problem in facility location, where it models the problem of locating a facility to minimize the cost of transportation.
The special case of the problem for three points in the plane (that is, ''m'' = 3 and ''n'' = 2 in the definition below) is sometimes also known as Fermat's problem; it arises in the construction of minimal Steiner trees, and was originally posed as a problem by Pierre de Fermat and solved by Evangelista Torricelli. Its solution is now known as the Fermat point of the triangle formed by the three sample points. The geometric median may in turn be generalized to the problem of minimizing the sum of ''weighted'' distances, known as the Weber problem after Alfred Weber's discussion of the problem in his 1909 book on facility location.〔 Some sources instead call Weber's problem the Fermat–Weber problem, but others use this name for the unweighted geometric median problem.
provides a survey of the geometric median problem. See for generalizations of the problem to non-discrete point sets.
==Definition==

Formally, for a given set of ''m'' points x_1, x_2, \dots, x_m\, with each x_i \in \mathbb^n, the geometric median is defined as
:Geometric Median =\underset^m \left \| x_i-y \right \|_2
Note that ''argmin'' means the value of the argument y which minimizes the sum. In this case, it is the point y from where the sum of all Euclidean distances to the x_i's is minimum.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Geometric median」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.